Stochastic Maximum Likelihood Optimization via Hypernetworks
نویسندگان
چکیده
This work explores maximum likelihood optimization of neural networks through hypernetworks. A hypernetwork initializes the weights of another network, which in turn can be employed for typical functional tasks such as regression and classification. We optimize hypernetworks to directly maximize the conditional likelihood of target variables given input. Using this approach we obtain competitive empirical results on regression and classification benchmarks.
منابع مشابه
Stochastic Hyperparameter Optimization through Hypernetworks
Machine learning models are often tuned by nesting optimization of model weights inside the optimization of hyperparameters. We give a method to collapse this nested optimization into joint stochastic optimization of weights and hyperparameters. Our process trains a neural network to output approximately optimal weights as a function of hyperparameters. We show that our technique converges to l...
متن کاملPrecision Matrix Computation via Stochastic Optimization A Scalable Computation of Regularized Precision Matrices via Stochastic Optimization
We consider the problem of computing a positive definite p × p inverse covariance matrix aka precision matrix θ = (θij) which optimizes a regularized Gaussian maximum likelihood problem, with the elastic-net regularizer ∑p i,j=1 λ(α|θij |+ 1 2 (1− α)θ 2 ij), with regularization parameters α ∈ [0, 1] and λ > 0. The associated convex semidefinite optimization problem is notoriously difficult to s...
متن کاملMaximum Likelihood Estimation for Stochastic Differential Equations Using Sequential Gaussian-Process-Based Optimization
Stochastic Differential Equations (SDEs) are used as statistical models in many disciplines. However, intractable likelihood functions for SDEs make inference challenging, and we need to resort to simulation-based techniques to estimate and maximize the likelihood function. While importance sampling methods have allowed for the accurate evaluation of likelihoods at fixed parameter values, there...
متن کاملEstimating Stochastically Ordered Survival Functions via Geometric Programming
Many procedures have been proposed to compute the nonparametric maximum likelihood estimates (NPMLEs) of survival functions under various stochastic ordering constraints. Each of the existing procedures is applicable only to a specific type of stochastic order constraint and often hard to implement. In this paper, we describe a method for computing the NPMLEs of survival functions, based on geo...
متن کاملFrom estimation to optimization via shrinkage
We study a class of quadratic stochastic programs where the distribution of random variables has unknown parameters. A traditional approach is to estimate the parameters using a maximum likelihood estimator (MLE) and to use this as input in the optimization problem. For the unconstrained case, we show that an estimator that shrinks the MLE towards an arbitrary vector yields a uniformly better r...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- CoRR
دوره abs/1712.01141 شماره
صفحات -
تاریخ انتشار 2017